GAPRec 2011 Proceedings of the 1 st Workshop on Goal , Activity and Plan Recognition ICAPS 2011

نویسندگان

  • David Pattison
  • Derek Long
  • Christopher Geib
  • Christopher W. Geib
چکیده

We present a method for incremental intention recognition by means of incrementally constructing a Bayesian Network (BN) model as more actions are observed. It is achieved based on a knowledge base of easily maintained and constructed fragments of BNs, connecting intentions to actions. The simple structure of the fragments enables to easily and efficiently acquire the knowledge base, either from domain experts or automatically from a plan corpus. We show experimental results improvement for the Linux Plan Corpus. In addition, we create a new, so-called IPD Plan Corpus, for strategies in the iterated Prisoner’s Dilemma and show the experimental results for it.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Alert correlation and prediction using data mining and HMM

Intrusion Detection Systems (IDSs) are security tools widely used in computer networks. While they seem to be promising technologies, they pose some serious drawbacks: When utilized in large and high traffic networks, IDSs generate high volumes of low-level alerts which are hardly manageable. Accordingly, there emerged a recent track of security research, focused on alert correlation, which ext...

متن کامل

A method of identifying suitable manufacturing system (Cellular) for automotive sector using Analytical Hierarchy Process

Manufacturing produces real wealth for any country and constitutes the back bone for the service sector. The objective of any organization is to earn profit. Usually the market fixes the selling price of the manufactured components. Unless there is focus on the manufacturing strategy of reducing manufacturing cost, it is very difficult to sustain in this ever competitive world. A suitable manuf...

متن کامل

Goal Recognition over POMDPs: Inferring the Intention of a POMDP Agent

Plan recognition is the problem of inferring the goals and plans of an agent from partial observations of her behavior. Recently, it has been shown that the problem can be formulated and solved using planners, reducing plan recognition to plan generation. In this work, we extend this model-based approach to plan recognition to the POMDP setting, where actions are stochastic and states are parti...

متن کامل

Parallelizing Plan Recognition

Modern multi-core computers provide an opportunity to parallelize plan recognition algorithms to decrease runtime. Viewing the problem as one of parsing and performing a complete breadth first search, makes ELEXIR (Engine for LEXicalized Intent Recognition)(Geib 2009; Geib & Goldman 2011) particularly suitable for such parallelism. This paper documents the extension of ELEXIR to utilize such mo...

متن کامل

Fixing a Hole in Lexicalized Plan Recognition

Previous work has suggested the use of lexicalized grammars for probabilistic plan recognition. Such grammars allow the domain builder to delay commitment to hypothesizing high level goals in order to reduce computational costs. However this delay has limitations. In the case of only partial observation traces, delaying commitment can prevent such algorithms from forming correct conclusions abo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011